Intensional First-Order Logic for P2P Database Systems

نویسنده

  • Zoran Majkic
چکیده

The meaning of concepts and views defined over a database ontology can be considered as intensional objects which have a particular extension in a given possible world: for instance in the actual world. Thus, non invasive mapping between completely independent peer databases in a P2P systems can be naturally specified by the set of couples of views, which have the same meaning (intension), over two different peers. Such a kind of mapping has very different semantics from standard view-based mappings based on material implication, commonly used for Data Integration Systems. The introduction of an intensional equivalence generates the quotient intensional FOL fundamental for a query answering in P2P systems. In this paper we introduce this formal intensional FOL by fusing Bealer’s intensional algebraic FOL with a possible-world semantics of the Montague’s FOL modal approach to natural language. We modify the Bealer’s intensional algebra in order to deal with relational databases and views, by introducing the join operation of relational algebra. Then we adopt the S5 Kripke frame in order to define an intensional equivalence relation between views for peer databases. Finally, we define an embedding of P2P database system into this quotient intensional FOL, and the computing of its extensionalization mapping in the actual Montague’s world.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sound and Complete Query Answering in Intensional P2P Data Integration

Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intensional FOL (First-order-logic) for P2P systems by fusing the Bealer’s intensional algebraic FOL with the S5 possible-world semantics of the Montague, we define the intensional equivalence relation for this logic and the we...

متن کامل

Flexible Intensional Query-Answering for RDF Peer-to-Peer Systems

We consider the Peer-To-Peer (P2P) database systems with RDF ontologies and with the semantic characterization of P2P mappings based on logical views over local peer’s ontology. Such kind of virtual-predicate based mappings needs an embedding of RDF ontologies into a predicate first-order logic, or at some of its sublanguages as, for example, logic programs for deductive databases. We consider ...

متن کامل

Non Omniscient Intensional Contextual Reasoning for Query-agents in P2P Systems

Given a de-centralized nature of the development of the Semantic Web, there will be an explosion in the number of ontologies in P2P systems. To integrate data from disparate ontologies, we must know the semantic correspondence between their elements. What we argue is the full epistemic independency of peer databases: they can change their ontology and/or extension of their knowledge independent...

متن کامل

Intensional P2P Mappings Between RDF Ontologies

We consider the Peer-To-Peer (P2P) database system with RDF ontologies and with the semantic characterization of P2P mappings based on logical views over local peer’s ontology. Such kind of virtual-predicate based mappings needs an embedding of RDF ontologies into a predicate first-order logic, or at some of its sublanguages as, for example, logic programs for deductive databases. We consider a...

متن کامل

Intensional Semantics for P2P Data Integration

One of the main issue in formalizing the Peer-To-Peer (P2P) database systems is the semantic characterization of P2P mappings. Each peer must be robust enough in order to take in account the incomplete and locally inconsistent information of its source databases, typical in Web applications. We consider a peer as a local epistemic logic system with its own belief, independent from other peers a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Data Semantics

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2009